CPO Models for GSOS Languages Part I: Compact GSOS Languages
نویسندگان
چکیده
In this paper, we present a general way of giving denotational semantics to a class of languages equipped with an operational semantics that fits the GSOS format of Bloom, Istrail and Meyer. The canonical model used for this purpose will be Abramsky’s domain of synchronization trees, and the denotational semantics automatically generated by our methods will be guaranteed to be fully abstract with respect to the finitely observable part of the bisimulation preorder. In the process of establishing the full abstraction result, we also obtain several general results on the bisimulation preorder (including a complete axiomatization for it), and give a novel operational interpretation of GSOS languages.
منابع مشابه
CPO Models for a Class of GSOS Languages
In this paper, we present a general way of giving denotational semantics to a class of languages equipped with an operational semantics that ts the GSOS format of Bloom, Istrail and Meyer. The canonical model used for this purpose will be Abramsky's domain of synchronization trees, and the denotational semantics automatically generated by our methods will be guaranteed to be fully abstract with...
متن کاملProving the validity of equations in GSOS languages using rule-matching bisimilarity
This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of th...
متن کاملA Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages
This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of th...
متن کاملAbstract Gsos Rules and a Compositional Treatment of Recursive Definitions
GSOS RULES AND A COMPOSITIONAL TREATMENT OF RECURSIVE DEFINITIONS STEFAN MILIUS, LAWRENCE S. MOSS, AND DANIEL SCHWENCKE Institut für Theoretische Informatik, Technische Universität Braunschweig, Germany e-mail address: [email protected] Department of Mathematics, Indiana University, Bloomington, IN, USA e-mail address: [email protected] Institut für Theoretische Informatik, Technische Univ...
متن کاملSubstitution in Structural Operational Semantics and value-passing process calculi
Consider a process calculus that allows agents to communicate values. The structural operational semantics involves substitution of values for variables. Existing rule formats, such as the GSOS format, do not allow this kind of explicit substitution in the semantic rules. We investigate how to derive rule formats for languages with substitution, by using categorical logic to interpret the frame...
متن کامل